Local convergence rates of simple evolutionary algorithms with Cauchy mutations
نویسنده
چکیده
The standard choice for mutating an individual of an evolutionary algorithm with con tinuous variables is the normal distribution however other distributions especially some versions of the multivariate Cauchy distribution have recently gained increased popularity in practical applications Here the extent to which Cauchy mutation distributions may a ect the local convergence behavior of evolutionary algorithms is analyzed The results show that the order of local convergence is identical for Gaussian and spherical Cauchy distributions whereas nonspherical Cauchy mutations lead to slower local convergence As a by product of the analysis some recommendations for the parametrization of the self adaptive step size control mechanism can be derived
منابع مشابه
Asymptotical Convergence Rates of Simple Evolutionary Algorithms under Factorizing Mutation Distributions
The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution. It is shown that there is a broad class of alternative mutation distributions ooering local convergence rates being asymptotical equal to the convergence rates achieved with normally distributed mutations. Such mutation distributions must be factorizing and the absol...
متن کاملConvergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
Rommel G. Regis Mathematics Department Saint Joseph’s University, Philadelphia, PA 19131, USA, [email protected] June 23, 2010 This paper presents some simple technical conditions that guarantee the convergence of a general class of adaptive stochastic global optimization algorithms. By imposing some conditions on the probability distributions that generate the iterates, these stochastic algorithm...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملAlgorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
DRAFT OF A PAPER PUBLISHED IN EA’2005 : Anne Auger, Mohamed Jebalia, Olivier Teytaud. (X,sigma,eta) : quasi-random mutations for Evolution Strategies. Proceedings of Evolutionary Algorihtms’2005, 12 pages. Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic aspect of evolution...
متن کاملخوشهبندی خودکار دادهها با بهرهگیری از الگوریتم رقابت استعماری بهبودیافته
Imperialist Competitive Algorithm (ICA) is considered as a prime meta-heuristic algorithm to find the general optimal solution in optimization problems. This paper presents a use of ICA for automatic clustering of huge unlabeled data sets. By using proper structure for each of the chromosomes and the ICA, at run time, the suggested method (ACICA) finds the optimum number of clusters while optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Evolutionary Computation
دوره 1 شماره
صفحات -
تاریخ انتشار 1997